Design of elliptic curve cryptoprocessors over GF(2^163) using the Gaussian normal basis
نویسندگان
چکیده
منابع مشابه
Fast Elliptic Curve Point Counting Using Gaussian Normal Basis
In this paper we present an improved algorithm for counting points on elliptic curves over finite fields. It is mainly based on SatohSkjernaa-Taguchi algorithm [SST01], and uses a Gaussian Normal Basis (GNB) of small type t ≤ 4. In practice, about 42% (36% for prime N) of fields in cryptographic context (i.e., for p = 2 and 160 < N < 600) have such bases. They can be lifted from FpN to ZpN in a...
متن کاملElliptic curve point counting over finite fields with Gaussian normal basis
In this paper, we present the GNB-aided MSST algorithm for the curves over finite fields that have a Gaussian normal basis of type t ≤ 2. It is based on the MSST algorithm proposed by P. Gaudry [3] at ASIACRYPT 2002. For those fields, we combine the lifting phase of the MSST algorithm and the norm computation algorithm in [6]. So the time complexity of the MSST is reduced from O(N) to O(N) and ...
متن کاملEfficient and low-complexity hardware architecture of Gaussian normal basis multiplication over GF(2 m ) for elliptic curve cryptosystems
In this paper an efficient high-speed architecture of Gaussian normal basis multiplier over binary finite field GF(2) is presented. The structure is constructed by using regular modules for computation of exponentiation by powers of 2 and low-cost blocks for multiplication by normal elements of the binary field. Since the exponents are powers of 2, the modules are implemented by some simple cyc...
متن کاملImplementation of Elliptic Curve Cryptosystems over GF(2) in Optimal Normal Basis on a Reconfigurable Computer
Reconfigurable Computers are general-purpose high-end computers based on a hybrid architecture and close system-level integration of traditional microprocessors and Field Programmable Gate Arrays (FPGAs). In this paper, we present an application of reconfigurable computers to developing a lowlatency implementation of Elliptic Curve Cryptosystems, an emerging class of public key cryptosystems us...
متن کاملEfficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography
We present a new sequential normal basis multiplier over GF (2). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to that of Agnew et al. Therefore it is supp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ingeniería e Investigación
سال: 2014
ISSN: 2248-8723,0120-5609
DOI: 10.15446/ing.investig.v34n2.40542